Bidirectional Importance Sampling for Unstructured Direct Illumination

نویسندگان

  • Rui Wang
  • Oskar Åkerlund
چکیده

Recent research in bidirectional importance sampling has focused primarily on structured illumination sources such as distant environment maps, while unstructured illumination has received little attention. In this paper, we present a method for bidirectional importance sampling of unstructured illumination, allowing us to use the same method for sampling both distant as well as local/indirect sources. Building upon recent work in [WFA∗05], we model complex illumination as a large set of point lights. The subsequent sampling process draws samples only from this point set. We start by constructing a piecewise constant approximation for the lighting using an illumination cut [CPWAP08]. We show that this cut can be used directly for illumination importance sampling. We then use BRDF importance sampling followed by sample counting to update the cut, resulting in a bidirectional distribution that closely approximates the product of the illumination and BRDF. Drawing visibility samples from this new distribution significantly reduces the sampling variance. As a main advance over previous work, our method allows for unstructured sources, including arbitrary local direct lighting and one-bounce of indirect lighting.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

IMPORTANCE RESAMPLING FOR GLOBAL ILLUMINATION by Justin

IMPORTANCE RESAMPLING FOR GLOBAL ILLUMINATION Justin F. Talbot Department of Computer Science Master of Science This thesis develops a generalized form of Monte Carlo integration called Resampled Importance Sampling. It is based on the importance resampling sample generation technique. Resampled Importance Sampling can lead to significant variance reduction over standard Monte Carlo integration...

متن کامل

Generic BRDF Sampling - A Sampling Method for Global Illumination

This paper introduces a new BRDF sampling method with reduced variance, which is based on a hierarchical adaptive parameterless PDF. This PDF is based also on rejection sampling with a bounded average number of trials, even in regions where the BRDF does exhibit high variations. Our algorithm works in an appropiate way with both physical and analytical reflectance models. Reflected directions a...

متن کامل

Image-Based Lighting on Surfaces with Arbitrary BRDF An Exercise in BRDF Importance Sampling, Sampling from a 2D Discrete Probability Function, and Multiple Importance Sampling

where we integrate over the unit sphere S. Unlike in the more general task of sampling indirect illumination, the incoming radiance L(ωi) is known (it is given by the environment map). The visibility function V (x, ωi) equals 1 if an infinite ray from x in direction ωi is not blocked by scene geometry, and 0 otherwise. We are focusing only on one surface point x observed from one outgoing direc...

متن کامل

An Importance Sampling Method for Arbitrary BRDFs

This paper introduces a new BRDF sampling method with reduced variance, which is based on a hierarchical adaptive PDF. This PDF also is based on rejection sampling with a bounded average number of trials, even in regions where the BRDF exhibits high variations. Our algorithm works in an appropiate way with both physical, analytical and measured reflectance models. Reflected directions are sampl...

متن کامل

A New Form Factor Analogy and its Application to Stochastic Global Illumination Algorithms

A new form factor analogy, that has been derived from results of integral geometry, is introduced. The new analogy is shown to be useful for stochastic evaluation of the local form of the rendering equation used in various Monte Carlo methods for calculating global illumination. It makes it possible to improve importance sampling in these methods, thereby speeding up convergence. A new class of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Comput. Graph. Forum

دوره 28  شماره 

صفحات  -

تاریخ انتشار 2009